SPANNERS OF COMPLETE k-PARTITE GEOMETRIC GRAPHSBOSE, Prosenjit; CARMI, Paz; COUTURE, Mathieu et al.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1803-1820, issn 0097-5397, 18 p.Article

Deciding nonconstructibility of 3-balls with spanning edges and interior verticesKAMEI, Satoshi.Discrete mathematics. 2007, Vol 307, Num 24, pp 3201-3206, issn 0012-365X, 6 p.Article

Simple constant amortized time generation of fixed length numeric partitionsBOYER, John M.Journal of algorithms (Print). 2005, Vol 54, Num 1, pp 31-39, issn 0196-6774, 9 p.Article

Two improved range-efficient algorithms for F₀ estimationHE SUN; CHUNG KEUNG POON.Theoretical computer science. 2009, Vol 410, Num 11, pp 1073-1080, issn 0304-3975, 8 p.Conference Paper

Finding a longest nonnegative path in a constant degree treeSUNG KWON KIM.Information processing letters. 2005, Vol 93, Num 6, pp 275-279, issn 0020-0190, 5 p.Article

Notions of hyperbolicity in monoidsHOFFMANN, Michael; THOMAS, Richard M.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 799-811, issn 0304-3975, 13 p.Conference Paper

On blockwise symmetric signatures for matchgatesCAI, Jin-Yi; PINYAN LU.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 739-750, issn 0304-3975, 12 p.Conference Paper

ODD MINIMUM CUT SETS AND b-MATCHINGS REVISITEDLETCHFORD, Adam N; REINELT, Gerhard; THEIS, Dirk Oliver et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1480-1487, issn 0895-4801, 8 p.Article

Holographic algorithms : The power of dimensionality resolvedCAI, Jin-Yi; PINYAN LU.Theoretical computer science. 2009, Vol 410, Num 18, pp 1618-1628, issn 0304-3975, 11 p.Article

POPULAR MATCHINGSABRAHAM, David J; IRVING, Robert W; KAVITHA, Telikepalli et al.SIAM journal on computing (Print). 2008, Vol 37, Num 4, pp 1030-1045, issn 0097-5397, 16 p.Article

Finding C₃-strong pseudoprimesZHENXIANG ZHANG.Mathematics of computation. 2005, Vol 74, Num 250, pp 1009-1024, issn 0025-5718, 16 p.Article

The runs conjectureCROCHEMORE, Maxime; ILIE, Lucian; TINTA, Liviu et al.Theoretical computer science. 2011, Vol 412, Num 27, pp 2931-2941, issn 0304-3975, 11 p.Article

Solution to a problem of Nicolas LichiardopolPHILPOTTS, Adam R; WATERS, Robert J.Discrete mathematics. 2010, Vol 310, Num 2, pp 360-363, issn 0012-365X, 4 p.Conference Paper

Pattern matching with pair correlation distancePORAT, Benny; PORAT, Ely; ZUR, Asaf et al.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 587-590, issn 0304-3975, 4 p.Article

Improved combinatorial group testing algorithms for real-world problem suzesEPPSTEIN, David; GOODRICH, Michael T; HIRSCHBERG, Daniel S et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1360-1375, issn 0097-5397, 16 p.Article

Three-dimensional periodicity and its application to pattern matchingGALIL, Zvi; JONG GEUN PARK; PARK, Kunsoo et al.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 2, pp 362-381, issn 0895-4801, 20 p.Article

Random generation of DFAsCHAMPARNAUD, Jean-Marc; PARANTHOËN, Thomas.Theoretical computer science. 2005, Vol 330, Num 2, pp 221-235, issn 0304-3975, 15 p.Conference Paper

Augmenting graphs for independent setsALEKSEEV, Vladimir E; LOZIN, Vadim V.Discrete applied mathematics. 2004, Vol 145, Num 1, pp 3-10, issn 0166-218X, 8 p.Conference Paper

Verifying a simplification of mutual exclusion by Lycklama―HadzilacosHESSELINK, Wim H.Acta informatica. 2013, Vol 50, Num 3, pp 199-228, issn 0001-5903, 30 p.Article

The equality problem for infinite words generated by primitive morphismsHONKALA, Juha.Information and computation (Print). 2009, Vol 207, Num 8, pp 900-907, issn 0890-5401, 8 p.Article

QUANTUM WALK ALGORITHM FOR ELEMENT DISTINCTNESSAMBAINIS, Andris.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 210-239, issn 0097-5397, 30 p.Article

A simple OPT + 1 algorithm for cutting stock under the modified integer round-up property assumptionJANSEN, Klaus; SOLIS-OBA, Roberto.Information processing letters. 2011, Vol 111, Num 10, pp 479-482, issn 0020-0190, 4 p.Article

An exact algorithm for minimum distortion embeddingFOMIN, Fedor V; LOKSHTANOV, Daniel; SAURABH, Saket et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3530-3536, issn 0304-3975, 7 p.Article

COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(nlogn) TIMEWEIMANN, Oren; YUSTER, Raphael.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 609-616, issn 0895-4801, 8 p.Article

ON COMPUTING THE FREQUENCIES OF INDUCED SUBHYPERGRAPHSNAGLE, Brendan.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 322-329, issn 0895-4801, 8 p.Article